Subgoaling Techniques for Satisficing and Optimal Numeric Planning
نویسندگان
چکیده
منابع مشابه
Heuristics for Numeric Planning via Subgoaling
The paper presents a new relaxation for hybrid planning with continuous numeric and propositional state variables based on subgoaling, generalising the subgoaling principle underlying the hmax and hadd heuristics to such problems. Our relaxation improves on existing interval-based relaxations by taking into account some negative interactions between effects when achieving a subgoal, resulting i...
متن کاملOptimal Satisficing
Herbert Simon introduced the notion of satisficing to explain how boundedly rational agents might approach difficult sequential decision problems. His satisficing decision makers were offered as an alternative to optimizers, who have impressive computational capacities which allow them to maximize. There is no reason, however, why satisficers can not do their task optimally. In this paper, we p...
متن کاملOptimal Satisficing Tree Searches
We provide an algorithm that finds optimal search strategies for and trees and or trees. Our model includes three outcomes when a node is explored: (1) finding a solution, (2) not finding a solution and realizing that there are no solutions beneath the current node (pruning), and (3) not finding a solution but not pruning the nodes below. The expected cost of examining a node and the probabilit...
متن کاملLandmarks for Numeric Planning Problems
The paper generalises the notion of landmarks for reasoning about planning problems involving propositional and numeric variables. Intuitively, numeric landmarks are regions in the metric space defined by the problem whose crossing is necessary for its resolution. The paper proposes a relaxationbased method for their automated extraction directly from the problem structure, and shows how to exp...
متن کاملDecision-Theoretic Subgoaling for Planning with External Events
I describe a planning methodology for domains with uncertainty in the form of external events that are not completely predictable. Under certain conditions, these events can be modelled as continuous-time Markov chains whose states are characterised by the planner’s domain predicates. Planning is goal-directed, but the subgoals are suggested by analysing the utility of the partial plan rather t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2020
ISSN: 1076-9757
DOI: 10.1613/jair.1.11875